HUANG, YOU, ABSIL, GALLIVAN: KARCHER MEAN IN ELASTIC SHAPE ANALYSIS 1 Karcher Mean in Elastic Shape Analysis*
نویسندگان
چکیده
In the framework of elastic shape analysis, a shape is invariant to scaling, translation, rotation and reparameterization. Since this framework does not yield a closed form of geodesic between two shapes, iterative methods have been proposed. In particular, path straightening methods have been proposed and used for computing a geodesic that is invariant to curve scaling and translation. Path straightening can then be exploited within a coordinate-descent algorithm that computes the best rotation and reparameterization of the end point curves [13]. A Riemannian quasi-Newton method to compute a geodesic invariant to scaling, translation, rotation and reparameterization has been given in [15] and shown to be more efficient than the coordinate-descent/path-straightening approach. This paper extends [15] by showing that using the new approach to the geodesic when computing the Karcher mean yields a faster algorithm.
منابع مشابه
Riemannian Optimization for Elastic Shape Analysis
In elastic shape analysis, a representation of a shape is invariant to translation, scaling, rotation and reparameterization and important problems (such as computing the distance and geodesic between two curves, the mean of a set of curves, and other statistical analyses) require finding a best rotation and re-parameterization between two curves. In this paper, we focus on this key subproblem ...
متن کاملElastic Morphing of 2D and 3D Objects on a Shape Manifold
We present a new method for morphing 2D and 3D objects. In particular we focus on the problem of smooth interpolation on a shape manifold. The proposed method takes advantage of two recent works on 2D and 3D shape analysis to compute elastic geodesics between any two arbitrary shapes and interpolations on a Riemannian manifold. Given a finite set of frames of the same (2D or 3D) object from a v...
متن کاملA Riemannian quasi-Newton method for computing the Karcher mean of symmetric positive definite matrices
This paper tackles the problem of computing the Karcher mean of a collection of symmetric positive-definite matrices. We present a concrete limited-memory Riemannian BFGS method to handle this computational task. We also provide methods to produce efficient numerical representations of geometric objects on the manifold of symmetric positive-definite matrices that are required for Riemannian opt...
متن کاملSecond order elastic metrics on the shape space of curves
Second order Sobolev metrics on the space of regular unparametrized planar curves have several desirable completeness properties not present in lower order metrics, but numerics are still largely missing. In this paper, we present algorithms to numerically solve the initial and boundary value problems for geodesics. The combination of these algorithms allows to compute Karcher means in a Rieman...
متن کاملCurve Matching with Applications in Medical Imaging
In the recent years, Riemannian shape analysis of curves and surfaces has found several applications in medical image analysis. In this paper we present a numerical discretization of second order Sobolev metrics on the space of regular curves in Euclidean space. This class of metrics has several desirable mathematical properties. We propose numerical solutions for the initial and boundary value...
متن کامل